// https://leetcode.cn/problems/house-robber/description/?envType=study-plan-v2&envId=top-interview-150

class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.size() < 2) {
            return nums[0];
        }

        vector<int> dp(nums.size());
        dp[0] = nums[0];
        dp[1] = max(nums[0], nums[1]);
        for (int i = 2; i < nums.size(); i++) {
            dp[i] = max(dp[i - 1], nums[i] + dp[i - 2]);
        }
        return dp[nums.size() - 1];
    }
};